| 翻訳と辞書 |
| Taxicab number ： ウィキペディア英語版 |
Taxicab number
In mathematics, the ''n''th taxicab number, typically denoted Ta(''n'') or Taxicab(''n''), is defined as the smallest number that can be expressed as a sum of two ''positive'' algebraic cubes in ''n'' distinct ways.
The name is derived from a conversation in about 1919 involving mathematicians G. H. Hardy and Srinivasa Ramanujan. As told by Hardy:
==Definition==
The concept was first mentioned in 1657 by Bernard Frénicle de Bessy, and was made famous in the early 20th century by a story involving Srinivasa Ramanujan. In 1938, G. H. Hardy and E. M. Wright proved that such numbers exist for all positive integers ''n'', and their proof is easily converted into a program to generate such numbers. However, the proof makes no claims at all about whether the thus-generated numbers are ''the smallest possible'' and thus it cannot be used to find the actual value of Ta(''n'').
The restriction of the summands to positive numbers is necessary, because allowing negative numbers allows for more (and smaller) instances of numbers that can be expressed as sums of cubes in ''n'' distinct ways. The concept of a cabtaxi number has been introduced to allow for alternative, less restrictive definitions of this nature. In a sense, the specification of two summands and powers of three is also restrictive; a generalized taxicab number allows for these values to be other than two and three, respectively.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Taxicab number」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|